搜索资源列表
8_12_1
- 魔陣的又一個實例。 你輸入一個素數,之後將會在相同的目錄下面 生成一個.txt文件,裏面有一個n*n的魔陣-Demon RUF also an example. You enter a prime number, followed in the same directory generated a below. Txt file, which has a n * n matrix of the magic
计算1000以内的素数
- 这是一个可以计算1000以内的素数算法 觉得还不错-This a 1000 can be calculated within the prime number algorithm also feel good
blackeye_elgamalkeygenerator10beta3
- 大素数生成器,根据用户的设置自动生成一个符合要求的大素数,计算速度较快。-large prime number generator, according to the automatic generation to meet the requirements of a large prime numbers, the fast calculation.
判断素数的个数
- 判断101-200之间有多少个素数,并输出所有素数。 1.程序分析:判断素数的方法:用一个数分别去除2到sqrt(这个数),如果能被整除, 则表明此数不是素数,反之是素数。 -judgment 101-200 between the number of primes, and the export of all prime numbers. 1. Program Analysis : judgment in several ways : with a few were t
TwinsPrime
- 这是高效的判定一个数是否为素数的算法,并且能够判断一个素数是否为孪素数-determine whether a number is prime algorithms, and to determine whether a prime number of twin primes
java_example
- 实例(java) 1. 编写一个程序,列出1 到1000 以内的,求59 的余后为1 质数。 2. 试编写程序解下面的问题。猴子吃桃问题:猴子第一天摘下若干个桃子,当即吃了 一半,还不瘾,又多吃了一个 第二天早上又将剩下的桃子吃掉一半,又多吃了一个。 以后每天早上都吃了前一天剩下的一半零一个。到第10 天早上想再吃时,见只剩 下一个桃子了。求第一天共摘了多少。 3. 编写一个程序求1+2!+3!+...+20!的和。 4. 试编写程序求解下面的问题:海滩上有一堆桃子,
Prime
- 特别简单的方法求100到200内的素数!-A perfect method for finding the prime number between 100 to 200
prime
- 用除法快速求质数,-Fast calculation of prime number division
prime
- USACO1.5寻找两个数字之间的回文数且是质数的数Prime Palindromes,例如151是回文数也是质数-The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes
Prime-number
- TC环境下,给一定数量寻找其中所有的质数。-Under the environment of TC, to find all the prime numbers to a certain number.
Determine-whether-a-number-is-prime
- 利用JAVA编写程序,用来判断一个自然数是不是素数的。-The use of JAVA programming, used to determine a natural number is not a prime number.
Prime-Checker
- Prime Checker RSA is one of the first practicable public-key cryptosystems and is widely used for secure data transmission. In such cryptosystems, primes play an important role. Hence, how to efficiently separate the primes the composite numbers is
prime
- prime number program puzzle question
Prime-
- VB code for prime number
prime-number
- Using this program you can find out the prime numbers between 1 to 100, 100 to 999 etc. You just need to input the range, for e.g. if you want the prime numbers 100 to 999 then enter numbers 100 and 999 when program prompts for input.-Using this prog
Seeking-twin-prime-numbers
- 所谓孪生素数指的是间隔为2的两个相邻素数,因为它们之间的距离已经近的不能再近了,如同孪生兄弟一样,所以将这一对素数称为孪生素数。 显然,最小的一对孪生素数是(1,3)。我们可以写出3〜 100以内的孪生素数,一共有8对,分别是(3,5),(5,7),(11,13),(17,19),(29,31),(41,43),(59,61)和(71,73)。随着数字的增大,孪生素数的分布也越来越稀疏,人工寻找孪生素数变得非常困难。 本题要解决的问题是:编程求出3〜
prime
- simple prime number find in C++
number
- 输入范围,可以输出一定范围内的全部回文素数例如,12321(nput range, you can output a certain range of all palindrome prime number)
prime
- 由小素数构造大素数的程序,由于知道大素数的分解形式,可求原根!(A program that constructs a large prime number from a small prime number)
the Mersenne prime
- 用Fortran语言写的一个简单的寻找梅森素数的小程序,主要是利用了二进制数组存储数据,然后用卢卡斯·莱默检验法判断所找到的数是否为梅森素数。(A simple program for finding Mason primes is written in Fortran language. It mainly uses binary arrays to store data, and then uses Lucas Lemmer test to determine whether the num